Optimal parameters for search using a barrier tree Markov model
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولPredicting Stock Returns Using a Variable Order Markov Tree Model
The weak form of the Efficient Market Hypothesis (EMH) states that the current market price fully reflects the information of past prices and rules out predictions based on price data alone. In an efficient market, consistent prediction of the next outcome of a financial time series is problematic because there are no reoccurring patterns that can be used for a reliable prediction. This researc...
متن کاملtuberculosis surveillance using a hidden markov model
background: routinely collected data from tuberculosis surveillance system can be used to investigate and monitor the irregularities and abrupt changes of the disease incidence. we aimed at using a hidden markov model in order to detect the abnormal states of pulmonary tuberculosis in iran. methods: data for this study were the weekly number of newly diagnosed cases with sputum smear-positive p...
متن کاملA Concurrency-Optimal Binary Search Tree
The paper presents the first concurrency-optimal implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an internal tree, ensures that every schedule is accepted, i.e., interleaving of steps of the sequential code, unless linearizability is violated. To ensure this property, we use a novel read-write locking scheme that protects tree e...
متن کاملNearly Optimal Minimax Tree Search?
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees aren’t uniform, the exact size of this tree isn’t known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.06.005